Visualization of Morse Connection Graphs for Topologically Rich 2D Vector Fields Supplementary material
نویسندگان
چکیده
The multivalued flow induced by a PC vector field defined on a manifold surface with no boundary is shown to be upper semicontinuous and admissible in [7]. Upper semicontinuity means that the limit of any convergent sequence of trajectory segments defined on a time interval [0,h] is a trajectory segment (defined on the same time interval). This property can be viewed as an extension of flow continuity to the multivalued case. Admissibility (not to be confused with admissibility of a merger operation discussed in Section 3.5 of the paper) means that the set of trajectory segments originating from any point defined on a time interval [0,h] is acyclic (i.e. is nonempty and has trivial reduced homology). In [7], it is shown that this set is contractible (and therefore also acyclic) for multivalued flows defined by PC vector fields on manifold surfaces. Note that this property is trivially satisfied for any single valued flow, if trajectories can be followed indefinitely in time. Because of uniqueness of trajectories, the set of trajectory segments described above contains precisely one trajectory, so it is acyclic. Topological invariants such as the fixed point index and Conley index can be generalized to multivalued flows that are upper semicontinuous and admissible [2, 3, 4]. The PC framework heavily builds on these topological invariants to describe the flow structure for PC vector fields in terms of features that generalize the classical flow features. From practical standpoint, admissibility means that the flow has similar topological properties to the standard single-valued flows. The proof in [7] is restricted to PC vector fields defined on triangulated manifold surfaces without boundary, so it needs to be extended to polygonal mesh domains with a boundary, handled as described in Section 3. The extension to polygonal meshes with convex faces is trivial: the argument in [7] carries over to this case. Alternatively, one could argue that the polygonal faces could be triangulated to directly reduce the polygonal mesh case to the triangle mesh case. The case of non-empty boundary can also be reduced to the manifold surface setting. The idea is to use a PC extension of the flow to the entire plane that makes the domain (call itD) attracting – similar to the extension used to compute the a-index in this paper. Such an extension can be built by adding a quad stripes that follow the boundary of D (Figure 23). Each of the quads is incident to precisely one boundary edge. The vector field value assigned to a quad points perpendicularly toward the boundary edge it is incident to. On edges between the adjacent quads, we set the direction of the flow to point toward D (as shown in the Figure – note that such edges are either exploding or im-
منابع مشابه
An image-space Morse decomposition for 2D vector fields
Morse decompositions have been proposed to compute and represent the topological structure of steady vector fields. Compared to the conventional differential topology, Morse decomposition and the resulting Morse Connection Graph (MCG) is numerically stable. However, the granularity of the original Morse decomposition is constrained by the resolution of the underlying spatial discretization, whi...
متن کاملSimplification of Morse Decompositions Using Morse Set Mergers
A common problem of vector field topology algorithms is the large number of the resulting topological features. This paper describes a method to simplify Morse decompositions by iteratively merging pairs of Morse sets that are adjacent in the Morse Connection Graph (MCG). When Morse sets A and B are merged, they are replaced by a single Morse set, that can be thought of as the union of A, B and...
متن کاملMorse connection graphs for piecewise constant vector fields on surfaces
We describe an algorithm for constructing Morse Connection Graphs (MCGs) of Piecewise Constant (PC) vector fields on surfaces. The main novel aspect of our algorithm is its way of dealing with false positives that could arise when computing Morse sets from an inexact graph representation. First, our MCG does not contain trivial Morse sets that may not contain any vector field features, or conta...
متن کاملCombinatorial 2D Vector Field Topology Extraction and Simplification
This paper investigates a combinatorial approach to vector field topology. The theoretical basis is given by Robin Forman’s work on a combinatorial Morse theory for dynamical systems defined on general simplicial complexes. We formulate Forman’s theory in a graph theoretic setting and provide a simple algorithm for the construction and topological simplification of combinatorial vector fields o...
متن کاملMorse Decomposition of 3D Piecewise Linear Vector Fields
Morse decomposition has been shown a reliable way to compute and represent vector field topology. Its computation first converts the original vector field into a directed graph representation, so that flow recurrent dynamics (i.e., Morse sets) can be identified as some strongly connected components of the graph. In this paper, we present a framework that enables the user to efficiently compute ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013